Accurate querying of frequent subgraphs in power grid graph data
نویسندگان
چکیده
منابع مشابه
Support Computation for Mining Frequent Subgraphs in a Single Graph
Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. However, if the input is one large graph, it is surprisingly difficult to find an appropriate support definition. In this paper we study the core problem, namely overlapping embeddings of the subgraph, in detail and suggest...
متن کاملInferring Graph Grammars by Detecting Overlap in Frequent Subgraphs
In this paper we study the inference of node and edge replacement graph grammars. We search for frequent subgraphs and then check for an overlap among the instances of the subgraphs in the input graph. If the subgraphs overlap by one node, we propose a node replacement graph grammar production. If the subgraphs overlap by two nodes or two nodes and an edge, we propose an edge replacement graph ...
متن کاملMining globally distributed frequent subgraphs in a single labeled graph
Recent years have observed increasing efforts on graph mining and many algorithms have been developed for this purpose. However, most of the existing algorithms are designed for discovering frequent subgraphs in a set of labeled graphs only. Also, the few algorithms that find frequent subgraphs in a single labeled graph typically identify subgraphs appearing regionally in the input graph. In co...
متن کاملFinding Frequent Subgraphs in a Single Graph based on Symmetry
Mining frequent subgraphs is a basic activity that plays an important role in mining graph data. In this paper an algorithm is proposed to find frequent subgraphs in a single large graph that has applications such as protein interactions, social networks, web interactions. One of the key operations required by any frequent subgraph discovery algorithm is to perform graph isomorphism. The propos...
متن کاملQuerying Graph Structured Data
We present the architecture of an end-to-end semantic search engine that uses a graph data model to enable interactive query answering over structured and interlinked data collected from many disparate sources on the Web. In particular, we study distributed indexing methods for graphstructured data and parallel query evaluation methods on a cluster of computers. We evaluate the system on a data...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Global Energy Interconnection
سال: 2019
ISSN: 2096-5117
DOI: 10.1016/j.gloei.2019.06.010